Convergence of the spectral radius of a random matrix through its characteristic polynomial
نویسندگان
چکیده
Consider a square random matrix with independent and identically distributed entries of mean zero unit variance. We show that as the dimension tends to infinity, spectral radius is equivalent root in probability. This result can also be seen convergence support circular law theorem under optimal moment conditions. In proof we establish reciprocal characteristic polynomial analytic function outside disc, related hyperbolic Gaussian function. The short differs from usual approaches for radius. It relies on tightness argument joint central limit phenomenon traces fixed powers.
منابع مشابه
On the Characteristic Polynomial of a Random Unitary Matrix
We present a range of fluctuation and large deviations results for the logarithm of the characteristic polynomial Z of a random N ×N unitary matrix, as N → ∞. First we show that lnZ/ √ 1 2 lnN , evaluated at a finite set of distinct points, is asymptotically a collection of i.i.d. complex normal random variables. This leads to a refinement of a recent central limit theorem due to Keating and Sn...
متن کاملThe characteristic polynomial of a random permutation matrix
We establish a central limit theorem for the logarithm of the characteristic polynomial of a random permutation matrix. With this result we can obtain a central limit theorem for the counting function for the eigenvalues lying in some interval on the unit circle.
متن کاملthe effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2021
ISSN: ['0178-8051', '1432-2064']
DOI: https://doi.org/10.1007/s00440-021-01079-9